On Deep Holes of Projective Reed-Solomon Codes over Finite Fields with Even Characteristic
نویسندگان
چکیده
Projective Reed-Solomon code is an important class of maximal distance separable codes in reliable communication and deep holes play roles its decoding. In this paper, we obtain two classes projective over finite fields with even characteristic. That is, let [see formula PDF] be field characteristic, PDF], the Lagrange interpolation polynomial first components received vector PDF]. Suppose that PDF]-th component 0, PDF],[see where a degree no more than Then hole fact, our result partially solved open problem on proposed by Wan 2020.
منابع مشابه
On deep holes of generalized projective Reed-Solomon codes
Abstract. Determining deep holes is an important topic in decoding Reed-Solomon codes. Cheng and Murray, Li and Wan, Wu and Hong investigated the error distance of generalized Reed-Solomon codes. Recently, Zhang and Wan explored the deep holes of projective Reed-Solomon codes. Let l ≥ 1 be an integer and a1, . . . , al be arbitrarily given l distinct elements of the finite field Fq of q element...
متن کاملExplicit Deep Holes of Reed-Solomon Codes
In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three classes of deep holes for projective Reed-Solomon (PRS) codes are constructed explicitly. In particular, deep holes of PRS codes with redundancy three are completely obtained when the character...
متن کاملDiscrete logarithm computations over finite fields using Reed-Solomon codes
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding. In this work, we experiment with solving the discrete logarithm over F q h using Reed-Solomon decoding. For fixed h and q going to infinity, we introduce an algorithm (RSDL) needing˜O(h! · q 2) operations over Fq, ope...
متن کاملOn the Deep Holes of Reed-Solomon Codes
Reed-Solomon codes were formally introduced to the world in 1960, and have been both practically and theoretically interesting since their introducion. Used in CD players, long-distance space communication, and computer networks, these simple codes have fascinated coding theorists and theoretical computer scientists for nearly five decades. In addition to being one of the Maximum Distance Seper...
متن کاملOn Deciding Deep Holes of Reed-Solomon Codes
For generalized Reed-Solomon codes, it has been proved [6] that the problem of determining if a received word is a deep hole is co-NP-complete. The reduction relies on the fact that the evaluation set of the code can be exponential in the length of the code – a property that practical codes do not usually possess. In this paper, we first presented a much simpler proof of the same result. We the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wuhan University Journal of Natural Sciences
سال: 2023
ISSN: ['1007-1202', '1993-4998']
DOI: https://doi.org/10.1051/wujns/2023281015